Improving polynomial evalution at an approximate root

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Policies Against Poverty: an Evalution

The explicit aim of these programs is to take people out of poverty, or at least to reduce poverty intensity. If the benefit is high enough to reach the poverty threshold, there are no time limits and the take-up rate is 100%, then poverty is automatically defeated (but this would be much too expensive). Otherwise, when benefits are low and support is not always granted until the end of the pov...

متن کامل

From an approximate to an exact absolute polynomial factorization

Abstract We propose an algorithm to compute an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebraic integers over Z and is certified. It relies on a study of the perturbations in a Vandermonde system. We provide a sufficient condition on the precision of the approximate factors, depending only on the height a...

متن کامل

Polynomial Minimum Root Separation

The minimum root separation of an arbitrary polynomial P is defined as the minimum of the distances between distinct (real or complex) roots of P. Some asymptotically good lower bounds for the root separation of P are given, where P may have multiple zeros. There are applications in the analysis of complexity of algorithms and in the theory of algebraic and transcendental numbers.

متن کامل

More Polynomial Root Squeezing

1. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed., John Wiley, 1968. 2. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1989. 3. R. Hirshon and R. De Simone, An offer you can’t refuse, Mathematics Magazine 81 (2008) 146–152. 4. L. Takács, On the classical ruin problems, J. American Stat...

متن کامل

Polynomial Root Motion

A polynomial is determined by its roots and its leading coefficient. If you set the roots in motion, the critical points will move too. Using only tools from the undergraduate curriculum, we find an inverse square law that determines the velocities of the critical points in terms of the positions and velocities of the roots. As corollaries we get the Polynomial Root Dragging Theorem and the Pol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1980

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/23.2.187